Modal Event Calculus in Lolli

نویسندگان

  • Iliano Cervesato
  • Luca Chittaro
  • Angelo Montanari
چکیده

This paper introduces two variants of the Event Calculus (EC) with relative timing of events: the Credulous and the Skeptical Event Calculus (CREC and SKEC respectively). A model that takes into account the dynamics of event ordering updates is constructed for EC. In this model, that appears to be a restriction of the usual model for the modal logic S4, CREC and SKEC are proved to be the modal counterparts of EC. It is then shown how a full propositional modal logic based on these calculi can be conveniently and elegantly coded by means of the linear logic programming language Lolli.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hierarchy of Modal Event Calculi: Expressiveness and Complexity

We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergot’s Event Calculus (EC ): given a set of event occurrences, EC allows the derivation of the maximal validity intervals (MVIs) over which properties initiated or terminated by those events hold. The formalisms we analy...

متن کامل

A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in the Event Calculus

In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. ...

متن کامل

Modal Event Calculus

We deened an extension of Kowalski and Sergot's Event Calculus (EC) 2] to deal with incomplete information about event ordering. Given a set of events, EC allows to derive maximal time intervals (MVIs) over which the properties they initiate or terminate hold. When only partial knowledge on event ordering is given, EC is neither able to derive all admissible MVIs nor to distinguish which of the...

متن کامل

Modal Event Calculi with Preconditions

Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) over which properties initiated or terminated by those events hold. The limited expressive power of EC is notably augmented by permitting events to initiate or terminate a property only if a given set of preconditions hol...

متن کامل

Database Updates in the Event Calculus

D This paper investigates a special case of the event calculus, concerned with database updates. It discusses the way relational databases, historical databases, modal logic, the situation calculus, and case semantics deal with database updates and compares the event calculus with the situation calculus in detail. It argues that the event calculus can overcome the computational aspects of the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994